Autocorrelation-function-based watermarking with side information

نویسندگان

  • Choong-Hoon Lee
  • Heung-Kyu Lee
  • Young-Ho Suh
چکیده

In this paper, we propose an improved autocorrelation function (ACF) based watermarking. The autocorrelation function based watermarking has been known to be one of the effective watermarking schemes that are resilient to geometric transform attacks. In this watermarking scheme, both the peaks in the autocorrelation function of a marked image and the embedded watermark should survive after various attacks. Generally, the autocorrelation peaks are less robust than the actual watermark signal. The main focus of this paper is the improvement of the robustness of the peaks in an autocorrelation function. Since an original image and the detector structure are available at the embedding time, instead of simple addition of a watermark to an image, the watermark embedder analyzes the original image and uses this information actively during the embedding process so that the marked image has higher periodic autocorrelation peaks. The proposed watermarking scheme has higher robustness than a conventional ACF based watermarking against geometric attacks that are combined with removal attacks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved autocorrelation function based watermarking with side information

We propose an improved autocorrelation function (ACF)based image watermarking that is robust to combined geometric and removal attacks. ACF-based watermarking is thought of as one of the most effective watermarking schemes that resist geometric attacks. In this watermarking scheme, the autocorrelation peaks of the watermark play an important role for geometric attack estimation. The peaks, howe...

متن کامل

Image Watermarking Resistant To Combined Geometric And Removal Attacks

In this paper, we propose an improved autocorrelation function (ACF)-based water21 marking that is robust against combined geometric and removal attacks. ACF-based watermarking is known to be effective against geometric attacks. In this watermark23 ing scheme, both the embedded watermark and autocorrelation peaks of the watermark should survive a variety of attacks. However, the autocorrelation...

متن کامل

Intelligent scalable image watermarking robust against progressive DWT-based compression using genetic algorithms

Image watermarking refers to the process of embedding an authentication message, called watermark, into the host image to uniquely identify the ownership. In this paper a novel, intelligent, scalable, robust wavelet-based watermarking approach is proposed. The proposed approach employs a genetic algorithm to find nearly optimal positions to insert watermark. The embedding positions coded as chr...

متن کامل

Forensic Tracking Watermarking against In-theater Piracy

Many illegal copies of digital movies by camcorder capture are found on the Internet or on the black market before their official release. Due to the angle of the camcorder relative to the screen, the copied movies are captured with perspective distortion. In this paper, we present a watermarking scheme for tracking the pirate using local auto-correlation function (LACF) to estimate geometric d...

متن کامل

Research on Color Watermarking Algorithm Based on RDWT-SVD

In this paper, a color image watermarking algorithm based on Redundant Discrete Wavelet Transform (RDWT) and Singular Value Decomposition (SVD) is proposed. The new algorithm selects blue component of a color image to carry the watermark information since the Human Visual System (HVS) is least sensitive to it. To increase the robustness especially towards affine attacks, RDWT is adopted for its...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003